Computer Science and Engineering

Design and Analysis of Algorithms Virtual Lab
  1. Introduction to Computational Complexity
  2. Recursion vs Iteration: Fibonacci Numbers
  3. Divide and Conquer Strategies I: Sorting
  4. Divide and Conquer Strategies II: Closest Pair of Points
  5. Greedy Algorithms I: Coin Change Problem
  6. Greedy Algorithms II: Fractional Knapsack
  7. Dynamic Programming I: Longest Common Subsequence (LCS)
  8. Dynamic Programming II: Rod Cutting Problem
  9. Single-Source Shortest Paths: Bellman–Ford Algorithm
  10. Network Flows: Maximum Flow Problem